Security number of grid-like graphs

نویسندگان

  • Kyohei Kozawa
  • Yota Otachi
  • Koichi Yamazaki
چکیده

The security number of a graph is the cardinality of a smallest vertex subset of the graph such that any attack on the subset is defendable. In this paper, we determine the security number of two-dimensional cylinders and tori. This result settles a conjecture of Brigham et al. [R.C. Brigham, R.D. Dutton, S.T. Hedetniemi, Security in graphs, Discrete Appl. Math. 155 (2007) 1708–1714]. © 2009 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On independent domination numbers of grid and toroidal grid directed graphs

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

متن کامل

The security number of strong grid-like graphs

The concepts of secure sets and security number in graphs were introduced first by Brigham et al. in 2007 as a generalization of the concept of alliances in graphs. Defensive alliances are related to the defense of a single vertex. But, in a general realistic settings, alliances should be formed so that any attack on the entire alliance or any subset of the alliance can be defended. In this sen...

متن کامل

Eternal m-security subdivision numbers in graphs

An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...

متن کامل

A Lightweight Privacy-preserving Authenticated Key Exchange Scheme for Smart Grid Communications

Smart grid concept is introduced to modify the power grid by utilizing new information and communication technology. Smart grid needs live power consumption monitoring to provide required services and for this issue, bi-directional communication is essential. Security and privacy are the most important requirements that should be provided in the communication. Because of the complex design of s...

متن کامل

Immune-Inspired Self-Protection Model for Securing Grid

The application of human immunology in solving security problems in Grid Computing seems to be a thought-provoking research area. Grid involves large number of dynamic heterogeneous resources. Manually managing the security for such dynamic system is always fault prone. This paper presents the simple immune based model for self-protection (SIMS) of grid environment from various attacks like DoS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 157  شماره 

صفحات  -

تاریخ انتشار 2009